Vehicle Routing with Time Windows and Split Deliveries
نویسندگان
چکیده
In this presentation, we consider the Split Delivery Vehicle Routing Problem with Time Windows (SDVRPTW) in which the delivery to a customer can be split between any number of vehicles. This problem has not been extensively studied in the literature. The main contribution of this paper is a Branch and Price approach for solving the SDVRPTW without imposing restrictions on the split delivery options. The computational results show that this approach works well and that split delivery can lead to significant improvements in terms of cost and number of vehicles used. 1 The Split Delivery Vehicle Routing Problem with Time Windows Let G = (V,A) be a directed graph with vertex set V = {v0, ..., vn} and arc set A. Vertices v1 to vn correspond to customers. The set of these customers is noted V . Customers require a delivery of some commodity. The expected quantity is assumed to be positive and is noted di. Vertex v0
منابع مشابه
Modeling the Time Windows Vehicle Routing Problem in Cross-Docking Strategy Using Two Meta-Heuristic Algorithms
In cross docking strategy, arrived products are immediately classified, sorted and organized with respect to their destination. Among all the problems related to this strategy, the vehicle routing problem (VRP) is very important and of special attention in modern technology. This paper addresses the particular type of VRP, called VRPCDTW, considering a time limitation for each customer/retai...
متن کاملVehicle Routing Problem: Simultaneous Deliveries and Pickups with Split Loads and Time Windows
The Vehicle Routing Problem with Simultaneous Deliveries and Pickups (VRPSDP) has attracted great interest in research due to its potential cost savings to transportation and logistics operators. There exist several extensions of VRPSDP, and among these extensions, Simultaneous Deliveries and Pickups with Split Loads Problem (SDPSLP) is particularly proposed for eliminating the vehicle capacity...
متن کاملExploring Heuristics for the Vehicle Routing Problem with Split Deliveries and Time Windows Dissertation
This dissertation investigates the Vehicle Routing Problem with Split Deliveries and Time Windows. This problem assumes a depot of homogeneous vehicles and set of customers with deterministic demands requiring delivery. Split deliveries allow multiple visits to a customer and time windows restrict the time during which a delivery can be made. Several construction and local search heuristics are...
متن کاملHeuristic for Site-Dependent Truck and Trailer Routing Problem with Soft and Hard Time Windows and Split Deliveries
In this paper we develop an iterative insertion heuristic for a site-dependent truck and trailer routing problem with soft and hard time windows and split deliveries. In the considered problem a truck can leave its trailer for unloading or parking, make a truck-subtour to serve truckcustomers, and return back to take the trailer. This can be done several times in one route. In our heuristic eve...
متن کاملTwo phase genetic algorithm for vehicle routing and scheduling problem with cross-docking and time windows considering customer satisfaction
Cross-docking is a new warehousing policy in logistics which is widely used all over the world and attracts many researchers attention to study about in last decade. In the literature, economic aspects has been often studied, while one of the most significant factors for being successful in the competitive global market is improving quality of customer servicing and focusing on customer satisfa...
متن کامل